circular-arc graph

См. также в других словарях:

• Circular-arc graph — A circular arc graph (left) and a corresponding arc model (right). In graph theory, a circular arc graph is the intersection graph of a set of arcs on the circle. It has one vertex for each arc in the set, and an edge between every pair of… …   Wikipedia

• Circular — is a basic geometric shape such as a Circle. Contents 1 Documents 2 Travel and transportation 3 Places …   Wikipedia

• Arc (geometry) — A circular sector is shaded in green. Its curved boundary of length L is a circular arc. In geometry, an arc is a closed segment of a differentiable curve in the two dimensional plane; for example, a circular arc is a segment of the circumference …   Wikipedia

• Intersection graph — In the mathematical area of graph theory, an intersection graph is a graph that represents the pattern of intersections of a family of sets. Any graph may be represented as an intersection graph, but some important special classes of graphs may… …   Wikipedia

• Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and …   Wikipedia

• Circle graph — For the chart, see Pie chart. A circle with five chords and the corresponding circle graph. In graph theory, a circle graph is the intersection graph of a set of chords of a circle. That is, it is an undirected graph whose vertices can be… …   Wikipedia

• Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i …   Wikipedia

• Cycle graph — This article is about connected, 2 regular graphs. For other uses, see Cycle graph (disambiguation). Cycle graph A cycle graph of length 6 Vertices n …   Wikipedia

• List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …   Wikipedia

• 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

• Cycle rank — In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close a digraph is to a directed acyclic graph (DAG), in the sense that a …   Wikipedia